IMPLEMENTATION OF JOHNSON'S SHORTEST PATH ALGORITHM FOR ROUTE DISCOVERY MECHANISM ON SOFTWARE DEFINED NETWORK
نویسندگان
چکیده
منابع مشابه
A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network
We consider shortest paths on a multi-modal transportation network where restrictions or preferences on the use of certain modes of transportation may arise. The regular language constraint shortest path problem deals with this kind of problem. It models constraints by using regular languages. The problem can be solved efficiently by using a generalization of Dijkstra’s algorithm (DRegLC). Rece...
متن کاملImplementation of Recurrent Neural Network Algorithm for Shortest Path Calculation in Network Routing
This paper describes the architecture and implementation of a shortest path processor, both in reconfigurable hardware and VLSI. This processor is based on the principles of recurrent spatiotemporal neural network. The processor’s operation is similar to Dijkstra’s algorithm and it can be used for network routing calculations. The objective of the processor is to find the least cost path in a w...
متن کاملImplementation and Performance Evaluation of a Multi-Path Incremental Shortest Path Algorithm in Quagga Routing Software
In this paper a multi-path incremental shortest path algorithm has been proposed allowing a quick reconfiguration of a routing table when a network topological change occurs. After evaluating the algorithm complexity, we have implemented it in Quagga, one of the most popular open source routing software. In order to evaluate the algorithm performance, we have realized a test-bed allowing the sh...
متن کاملMulticasting with the Extended Dijkstra’s Shortest Path Algorithm for Software Defined Networking
This work proposes a multicast algorithm on the basis of the extended Dijkstra’s shortest path algorithm for Software Defined Networking (SDN) to run on top of the controller. The proposed muticast algorithm is used to generate a multicast tree for a data publisher to deliver data packets to all subscribers so that every node and every host on the multicast tree will receive every packet once a...
متن کاملShortest Path Routing Algorithm for Hierarchical Interconnection Network-on-Chip
Interconnection networks play a significant role in efficient on-chip communication for multicore systems. This paper introduces a new interconnection topology called the Hierarchical Cross Connected Recursive network (HCCR) and a shortest path routing algorithm for the HCCR. Proposed topology offers a high degree of regularity, scalability, and symmetry with a reduced number of links and node ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JUTI: Jurnal Ilmiah Teknologi Informasi
سال: 2021
ISSN: 2406-8535,1412-6389
DOI: 10.12962/j24068535.v19i1.a1011